Published in: LIPIcs, Volume 272, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Sergei Ovcharov. OBDD(Join) Proofs Cannot Be Balanced. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 72:1-72:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{ovcharov:LIPIcs.MFCS.2023.72, author = {Ovcharov, Sergei}, title = {{OBDD(Join) Proofs Cannot Be Balanced}}, booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, pages = {72:1--72:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-292-1}, ISSN = {1868-8969}, year = {2023}, volume = {272}, editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.72}, URN = {urn:nbn:de:0030-drops-186065}, doi = {10.4230/LIPIcs.MFCS.2023.72}, annote = {Keywords: Proof complexity, OBDD, lower bounds, depth of proofs} }
Feedback for Dagstuhl Publishing